منابع مشابه
When Are Fredholm Triples Operator Homotopic?
Fredholm triples are used in the study of Kasparov’s KK-groups, and in Connes’s noncommutative geometry. We define an absorption property for Fredholm triples, and give an if and only if condition for a Fredholm triple to be absorbing. We study the interaction of the absorption property with several of the more common equivalence relations for Fredholm triples. In general these relations are co...
متن کاملCodimension One Spheres Which Are Null Homotopic
Grove and Halperin [3] introduced a notion of taut immersions. Terng and Thorbergsson [5] give a slightly different definition and showed that taut immersions are a simultaneous generalization of taut immersions of manifolds into Euclidean spaces or spheres, and some interesting embeddings constructed by Bott and Samelson [1]. They go on to prove many theorems about such immersions. One particu...
متن کامل9 There are non homotopic framed homotopies of long knots
Let M be the space of all, including singular, long knots in 3space and for which a fixed projection into the plane is an immersion. Let cl(Σ (1) iness) be the closure of the union of all singular knots in M with exactly one ordinary double point and such that the two resolutions represent the same (non singular) knot type. We call Σ (1) iness the inessential walls and we call Mess = M\ cl(Σ (1...
متن کاملAll two dimensional links are null homotopic Arthur
We show that any number of disjointly embedded 2{spheres in 4{space can be pulled apart by a link homotopy, ie, by a motion in which the 2{spheres stay disjoint but are allowed to self-intersect. AMS Classi cation numbers Primary: 57Q45
متن کاملAre two given maps homotopic? An algorithmic viewpoint
This paper presents two algorithms. In their simplest form, the first algorithm decides the existence of a pointed homotopy between given simplicial maps f , g : X → Y and the second computes the group [ΣX, Y ] * of pointed homotopy classes of maps from a suspension; in both cases, the target Y is assumed simply connected and the algorithms run in polynomial time when the dimension of X is fixe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1968
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1968-0232394-6